-
1 nondeterministic Turing machine
2) Программирование: недетерминированная машина ТьюрингаУниверсальный англо-русский словарь > nondeterministic Turing machine
-
2 nondeterministic Turing machine
вчт недетерминированная машина ТьюрингаEnglish-Russian electronics dictionary > nondeterministic Turing machine
-
3 nondeterministic Turing machine
вчт. недетерминированная машина ТьюрингаThe New English-Russian Dictionary of Radio-electronics > nondeterministic Turing machine
-
4 machine
1) машина; станок || подвергать обработке; обрабатывать на станке2) механизм; простейший механизм3) установка; устройство; аппарат4) компьютер, электронная вычислительная машина, ЭВМ•- adding machine
- airport X-ray machine
- alignment machine
- analog machine
- answering machine
- automated teller machine
- automatic calling machine
- automatic magazine-fed sputtering machine
- Boltzman machine
- bonding machine
- broadcast machine
- business machine
- cash machine
- Cauchy machine
- commutating machine
- compatible video/audio machine
- copy machine
- copying machine
- database machine
- data-processing machine
- deterministic Turing machine
- dictating machine
- digital machine
- domestic mains/battery machine
- electronic data processing machine
- electrostatic copying machine
- facsimile machine
- fax machine
- finite-state machine
- firewall machine
- flash-X-ray machine
- gateway machine
- Hollerith tabulating/recording machine
- inference machine
- injection molding machine
- instrumentation machine
- Java virtual machine
- learning machine
- mirror machine
- money machine
- nondeterministic Turing machine
- numerically controlled optical pattern generating machine
- parallel machine
- parallel virtual machine
- photocopying machine
- plasma confinement machine
- precision drawing machine
- print-recognition machine
- protocol machine
- reduction machine
- reel-to-reel machine
- reversible tape machine
- SAM machine
- segmented scan machine
- sequential machine
- simple machine
- single-head machine
- S-K reduction machine
- Skinner's teaching machine
- slot machine
- smart machine
- state machine
- synchronous active memory machine
- teaching machine
- time machine
- trial-and-error learning machine
- Turing machine
- two-level virtual machine machine
- universal Turing machine
- vending machine
- video-game machine
- virtual machine machine
- von Neumann machine
- voting machine
- Warren abstract machine
- wave soldering machine
- wire-marking machine
- wire-routing machine -
5 machine
1) машина; станок || подвергать обработке; обрабатывать на станке2) механизм; простейший механизм3) установка; устройство; аппарат4) компьютер, электронная вычислительная машина, ЭВМ•- adding machine
- airport X-ray machine
- alignment machine
- analog machine
- answering machine
- automated teller machine
- automatic calling machine
- automatic magazine-fed sputtering machine
- Boltzman machine
- bonding machine
- broadcast machine
- business machine
- cash machine
- Cauchy machine
- commutating machine
- compatible video/audio machine
- copy machine
- copying machine
- database machine
- data-processing machine
- deterministic Turing machine
- dictating machine
- digital machine
- domestic mains/battery machine
- electronic data processing machine
- electrostatic copying machine
- facsimile machine
- fax machine
- finite-state machine
- firewall machine
- flash-X-ray machine
- gateway machine
- Hollerith tabulating/recording machine
- inference machine
- injection molding machine
- instrumentation machine
- Java virtual machine
- learning machine
- mirror machine
- money machine
- nondeterministic Turing machine
- numerically controlled optical pattern generating machine
- parallel machine
- parallel virtual machine
- photocopying machine
- plasma confinement machine
- precision drawing machine
- print-recognition machine
- protocol machine
- reduction machine
- reel-to-reel machine
- reversible tape machine
- SAM machine
- segmented scan machine
- sequential machine
- simple machine
- single-head machine
- S-K reduction machine
- Skinner's teaching machine
- slot machine
- smart machine
- state machine
- synchronous active memory machine
- teaching machine
- time machine
- trial-and-error learning machine
- Turing machine
- two-level virtual machine machine
- universal Turing machine
- vending machine
- video-game machine
- virtual machine machine
- von Neumann machine
- voting machine
- Warren abstract machine
- wave soldering machine
- wire-marking machine
- wire-routing machineThe New English-Russian Dictionary of Radio-electronics > machine
-
6 NTM
nondeterministic Turing machine - недетерминистическая криптологическая машина Тьюринга -
7 NTM
1) Общая лексика: Next Twelve Months2) Авиация: Руководство по неразрушающему контролю3) Военный термин: Nuke The Mothers, national technical means, НТС, национальные технические средства4) Техника: nondeterministic Turing machine5) Строительство: нетарифные меры (nontariff measures)6) Математика: Notice To Members7) Религия: New Tribes Mission8) Торговля: New To Market9) Сокращение: National Technical Means of evaluation, Notice To Mariners, Notice To Move, night message10) Физиология: Nontuberculous Mycobacteria11) Фирменный знак: National Tool and Manufacturing Company, Northwestern Travel Management12) НАСА: Network Test Manager
См. также в других словарях:
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Symmetric Turing machine — Definition of symmetric Turing machines: SL was first defined in 1982 by Lewis and Papadimitriou, [Jesper Jansson. [http://www.df.lth.se/ jj/Publications/STCON2.ps Deterministic Space Bounded Graph Connectivity Algorithms] . Manuscript. 1998.]… … Wikipedia
Non-deterministic Turing machine — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… … Wikipedia
Read-only Turing machine — A read only Turing machine or Two way deterministic finite state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape.… … Wikipedia
Machine that always halts — In computability theory, a machine that always halts also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) is a Turing machine that halts for every input. Because it always halts, the machine is able to decide whether a… … Wikipedia
Nondeterministic algorithm — In computer science, a nondeterministic algorithm is an algorithm that can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A… … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
